Multi-robot three-dimensional coverage of unknown areas
نویسندگان
چکیده
منابع مشابه
Multi-Robot 3D Coverage of Unknown Areas
The problem of deploying a team of flying robots to perform surveillance coverage mission over an unknown terrain of complex and non-convex morphology is presented. In such a mission, the robots attempt to maximize the part of the terrain that is visible while keeping the distance between each point in the terrain and the closest team member as small as possible. A trade-off between these two o...
متن کاملHomogeneous Hierarchical Composition of Areas in Multi-robot Area Coverage
Multi-robot area coverage poses several research challenges. The challenge of coordinating multiple robots’ actions coupled with the challenge of minimizing the overlap in coverage across robots becomes even more complex and critical when large teams and large areas are involved. In fact, the efficiency critically hinges on the coordination algorithms used and the robot capabilities. Multi-robo...
متن کاملMulti-Robot Adversarial Coverage
This work discusses the problem of adversarial coverage, in which one or more robots are required to visit every point of a given area, which contains threats that might stop the robots. The objective of the robots is to cover the target area as quickly as possible, while maximizing the percentage of covered area before they are stopped. This problem has many real-world applications, from perfo...
متن کاملOn multi-robot area coverage
Area coverage is one of the emerging problems in multi-robot coordination. In this task a team of robots is cooperatively trying to observe or sweep an entire area, possibly containing obstacles, with their sensors or actuators. The goal is to build an efficient path for each robot which jointly ensure that every single point in the environment can be seen or swept by at least one of the robots...
متن کاملMulti-robot repeated area coverage
We address the problem of repeated coverage of a target area, of any polygonal shape, by a team of robots having a limited visual range. Three distributed Clusterbased algorithms, and a method called Cyclic Coverage are introduced for the problem. The goal is to evaluate the performance of the repeated coverage algorithms under the effects of the variables: Environment Representation, and the R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Robotics Research
سال: 2012
ISSN: 0278-3649,1741-3176
DOI: 10.1177/0278364912439332